Band Unfoldings and Prismatoids: A Counterexample
نویسنده
چکیده
This note shows that the hope expressed in [ADL07]—that the new algorithm for edge-unfolding any polyhedral band without overlap might lead to an algorithm for unfolding any prismatoid without overlap—cannot be realized. A prismatoid is constructed whose sides constitute a nested polyhedral band, with the property that every placement of the prismatoid top face overlaps with the band unfolding.
منابع مشابه
Unfolding Smooth Prismatoids
We define a notion for unfolding smooth, ruled surfaces, and prove that every smooth prismatoid (the convex hull of two smooth curves lying in parallel planes), has a nonoverlapping “volcano unfolding.” These unfoldings keep the base intact, unfold the sides outward, splayed around the base, and attach the top to the tip of some side rib. Our result answers a question for smooth prismatoids who...
متن کاملUnfolding Smooth Primsatoids
We define a notion for unfolding smooth, ruled surfaces, and prove that every smooth prismatoid (the convex hull of two smooth curves lying in parallel planes), has a nonoverlapping “volcano unfolding.” These unfoldings keep the base intact, unfold the sides outward, splayed around the base, and attach the top to the tip of some side rib. Our result answers a question for smooth prismatoids who...
متن کاملCase Study: Verification of a Leader Election Protocol using Augur
We consider a case study of a leader election protocol and verify it using the tool Augur, which is based on unfolding techniques for graph transformation systems. We first investigate a finite-state variant of the leader election protocol and show how to verify it using McMillanstyle unfoldings, avoiding an exponential explosion of the state space. Then, in a next step, we consider a parametri...
متن کاملUnfolding Prismatoids as Convex Patches: Counterexamples and Positive Results
We address the unsolved problem of unfolding prismatoids in a new context, viewing a “topless prismatoid” as a convex patch—a polyhedral subset of the surface of a convex polyhedron homeomorphic to a disk. We show that several natural strategies for unfolding a prismatoid can fail, but obtain a positive result for “petal unfolding” topless prismatoids. We also show that the natural extension to...
متن کاملAn encoding of array verification problems into array-free Horn clauses
Automatically verifying safety properties of programs is hard, and it is even harder if the program acts upon arrays or other forms of maps. Many approaches exist for verifying programs operating upon Boolean and integer values (e.g. abstract interpretation, counterexample-guided abstraction refinement using interpolants), but transposing them to array properties has been fraught with difficult...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0710.0811 شماره
صفحات -
تاریخ انتشار 2007